0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : satallax -E eprover -P picomus -M modes -p tstp -t %d %s
0.03/0.23	% Computer   : n134.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sun Jul 15 12:16:54 CDT 2018
0.03/0.24	% CPUTime    : 
0.96/1.19	% SZS status Theorem
0.96/1.19	% Mode: mode506
0.96/1.19	% Inferences: 19399
0.96/1.19	% SZS output start Proof
0.96/1.19	thf(ty_$i, type, $i : $tType).
0.96/1.19	thf(ty_eigen__0, type, eigen__0 : ((($i>$i)>$i)>(($i>$i)>$i)>$o)).
0.96/1.19	thf(h0, assumption, (![X1:((($i>$i)>$i)>(($i>$i)>$i)>$o)>$o]:(![X2:(($i>$i)>$i)>(($i>$i)>$i)>$o]:((X1 @ X2) => (X1 @ (eps__0 @ X1))))),introduced(assumption,[])).
0.96/1.19	thf(eigendef_eigen__0, definition, (eigen__0 = (eps__0 @ (^[X1:(($i>$i)>$i)>(($i>$i)>$i)>$o]:(~((~((![X2:($i>$i)>$i]:(~(((![X3:($i>$i)>$i]:((X1 @ X3) @ X3)) => ((X1 @ (^[X3:$i>$i]:(X3 @ (X2 @ (^[X4:$i]:X4))))) @ X2)))))))))))), introduced(definition,[new_symbols(definition,[eigen__0]))).
0.96/1.19	thf(sP1,plain,(sP1 <=> (![X1:($i>$i)>$i]:(~(((![X2:($i>$i)>$i]:((eigen__0 @ X2) @ X2)) => ((eigen__0 @ (^[X2:$i>$i]:(X2 @ (X1 @ (^[X3:$i]:X3))))) @ X1))))),introduced(definition,[new_symbols(definition,[sP1])]))).
0.96/1.19	thf(sP2,plain,(sP2 <=> ((![X1:($i>$i)>$i]:((eigen__0 @ X1) @ X1)) => ((eigen__0 @ (^[X1:$i>$i]:(X1 @ (@+[X2:$i]:((eigen__0 @ (^[X3:$i>$i]:X2)) @ (^[X3:$i>$i]:X2)))))) @ (^[X1:$i>$i]:(X1 @ (@+[X2:$i]:((eigen__0 @ (^[X3:$i>$i]:X2)) @ (^[X3:$i>$i]:X2))))))),introduced(definition,[new_symbols(definition,[sP2])]))).
0.96/1.19	thf(sP3,plain,(sP3 <=> ((eigen__0 @ (^[X1:$i>$i]:(X1 @ (@+[X2:$i]:((eigen__0 @ (^[X3:$i>$i]:X2)) @ (^[X3:$i>$i]:X2)))))) @ (^[X1:$i>$i]:(X1 @ (@+[X2:$i]:((eigen__0 @ (^[X3:$i>$i]:X2)) @ (^[X3:$i>$i]:X2)))))),introduced(definition,[new_symbols(definition,[sP3])]))).
0.96/1.19	thf(sP4,plain,(sP4 <=> ((![X1:($i>$i)>$i]:((eigen__0 @ X1) @ X1)) => ((eigen__0 @ (^[X1:$i>$i]:(X1 @ (@+[X2:$i]:((eigen__0 @ (^[X3:$i>$i]:X2)) @ (^[X3:$i>$i]:X2)))))) @ (^[X1:$i>$i]:(@+[X2:$i]:((eigen__0 @ (^[X3:$i>$i]:X2)) @ (^[X3:$i>$i]:X2)))))),introduced(definition,[new_symbols(definition,[sP4])]))).
0.96/1.19	thf(sP5,plain,(sP5 <=> (![X1:(($i>$i)>$i)>(($i>$i)>$i)>$o]:(~((![X2:($i>$i)>$i]:(~(((![X3:($i>$i)>$i]:((X1 @ X3) @ X3)) => ((X1 @ (^[X3:$i>$i]:(X3 @ (X2 @ (^[X4:$i]:X4))))) @ X2)))))))),introduced(definition,[new_symbols(definition,[sP5])]))).
0.96/1.19	thf(sP6,plain,(sP6 <=> (![X1:($i>$i)>$i]:((eigen__0 @ X1) @ X1)),introduced(definition,[new_symbols(definition,[sP6])]))).
0.96/1.19	thf(cUNIFTHM1,conjecture,sP5).
0.96/1.19	thf(h1,negated_conjecture,(~(sP5)),inference(assume_negation,[status(cth)],[cUNIFTHM1])).
0.96/1.19	thf(1,plain,(sP5 | sP1),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__0])).
0.96/1.19	thf(2,plain,(~(sP1) | ~(sP4)),inference(all_rule,[status(thm)],[])).
0.96/1.19	thf(3,plain,(sP4 | sP6),inference(prop_rule,[status(thm)],[])).
0.96/1.19	thf(4,plain,(~(sP6) | sP3),inference(all_rule,[status(thm)],[])).
0.96/1.19	thf(5,plain,(~(sP1) | ~(sP2)),inference(all_rule,[status(thm)],[])).
0.96/1.19	thf(6,plain,(sP2 | ~(sP3)),inference(prop_rule,[status(thm)],[])).
0.96/1.19	thf(7,plain,$false,inference(prop_unsat,[status(thm),assumptions([h1,h0])],[h1,1,2,3,4,5,6])).
0.96/1.19	thf(8,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[7,h0])).
0.96/1.19	% SZS output end Proof
0.96/1.19	EOF